Multiple Sequence Alignments with Parallel Computing

نویسندگان

  • Charu Sharma
  • Pankaj Agrawal
  • Preeti Gupta
چکیده

The growth of bioinformatics and computational biology industry, multiple sequence alignment (MSA) applications have become an important emerging workload. In spite of the large amount of recent attention given to the MSA software design, there has been little quantitative understanding of the performance of such applications on modern microprocessors and systems. In this paper we try to analyze performance and characteristics of MSA software from

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple molecular sequence alignment by island parallel genetic algorithm

This paper presents an evolution-based approach for solving multiple molecular sequence alignment. The approach is based on the island parallel genetic algorithm that relies on the fitness distribution over the population of alignments. The algorithm searches for an alignment among the independent isolated evolving populations by optimizing weighted sum of pairs objective function which measure...

متن کامل

PARALLEL-TCOFFEE: A parallel multiple sequence aligner

In this paper we present a parallel implementation of T–Coffee — a widely used multiple sequence alignment package. Our software supports a majority of options provided by the sequential program, including the 3D–coffee mode, and uses a message passing paradigm to distribute computations and memory. The main stages of T–Coffee, that is library generation and progressive alignment, have been par...

متن کامل

A Theoretical Study of Extreme Parallelism in Sequence Alignments

In this paper, we describe fully parallelized architectures for one-to-one, one-to-many, and many-to-many sequence alignments using Smith-Waterman algorithm. The architectures utilize the principles of parallelism and pipelining to the greatest extent in order to take advantage of both intrasequence and inter-sequence parallelization and to achieve high speed and throughput. First, we describe ...

متن کامل

Parallel Sequence Alignment in Limited Space

Sequence comparison with affine gap costs is a problem that is readily parallelizable on simple single-instruction, multiple-data stream (SIMD) parallel processors using only constant space per processing element. Unfortunately, the twin problem of sequence alignment, finding the optimal character-by-character correspondence between two sequences, is more complicated. While the innovative O(n2)...

متن کامل

Parallelized multiple alignment

UNLABELLED Multiple sequence alignment is a frequently used technique for analyzing sequence relationships. Compilation of large alignments is computationally expensive, but processing time can be considerably reduced when the computational load is distributed over many processors. Parallel processing functionality in the form of single-instruction multiple-data (SIMD) technology was implemente...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014